The arithmetic Tutte polynomials of the classical root systems
نویسندگان
چکیده
Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial. We compute the arithmetic Tutte polynomials of the classical root systems An, Bn, Cn, and Dn with respect to their integer, root, and weight lattices. We do it in two ways: by introducing a finite field method for arithmetic Tutte polynomials, and by enumerating signed graphs with respect to six parameters.
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملOn the Algebraic Complexity of Some Families of Coloured Tutte Polynomials
We investigate the coloured Tutte polynomial in Valiant’s algebraic framework of NP-completeness. Generalising the well known relationship between the Tutte polynomial and the partition function from the Ising model, we establish a reduction from the permanent to the coloured Tutte polynomial, thus showing that its evaluation is a VNP−complete problem.
متن کاملARITHMETIC-BASED FUZZY CONTROL
Fuzzy control is one of the most important parts of fuzzy theory for which several approaches exist. Mamdani uses $alpha$-cuts and builds the union of the membership functions which is called the aggregated consequence function. The resulting function is the starting point of the defuzzification process. In this article, we define a more natural way to calculate the aggregated consequence funct...
متن کاملParametrized Tutte Polynomials of Graphs and Matroids
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky, and Bollobás and Riordan. We give a generalized Zaslavsky– Bollobás–Riordan theorem that characterizes parametrized contraction–deletion functions on minor-closed classes of matroids, as well as the modifications necessary to apply the discussion to classes of graphs. In gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013